Publication list We list below the publications acknowledging Milyon. They are sorted by • Papers published in peer-reviewed journals extracted from Web of Science database and mentioning Milyon in the text. • Paper

Source URL: milyon.universite-lyon.fr

A full version of this paper is available at https://papernot.fr/files/extending-distillation.pdf Poster: Extending Defensive Distillation Nicolas Papernot and Patrick McDaniel Pennsylvania State University {ngp5056,mcd

Source URL: www.ieee-security.org

• Computational neuroscience
• Chemistry
• Applied mathematics
• Artificial neural networks
• Phase transitions
• Statistics
• Scientific modeling
• Design of experiments
• Deep learning
• Distillation
• Outlier
• Surrogate model

Utilizing S-TaLiRo as an Automatic Test Generation Framework for Autonomous Vehicles Cumhur Erkan Tuncali, Theodore P. Pavlic and Georgios Fainekos Abstract— This paper proposes an approach to automatically generating

Source URL: www.public.asu.edu

• Computational science
• Applied mathematics
• Modeling and simulation
• Scientific modeling
• Simulation
• Computer simulation
• Control theory
• Self-driving car
• Systems science

Predicate Abstraction for Programmable Logic Controllers Sebastian Biallas, Mirco Giacobbe and Stefan Kowalewski Embedded Software Laboratory, RWTH Aachen University, Germany Abstract. In this paper, we present a predic

Source URL: pub.ist.ac.at

• Mathematical logic
• Predicate logic
• Mathematics
• Logic
• Predicate variable
• Scope
• Atomic sentence
• FO
• First-order logic
• Variable
• Structured text
• Assignment

NEARBY SLOPES AND BOUNDEDNESS FOR `-ADIC SHEAVES IN POSITIVE CHARACTERISTIC by Jean-Baptiste Teyssier Abstract. — The goal of this paper is to motivate a boundedness conjecture for

Source URL: jbteyssier.com

• Algebra
• Abstract algebra
• Ring theory
• Algebraic number theory
• Field theory
• Complex analysis
• Algebraic topology
• Ramification
• Conductor
• Valuation
• Proper morphism
• Field extension

Cubicle: A Parallel SMT-based Model Checker for Parameterized Systems Tool Paper Sylvain Conchon1 , Amit Goel2 , Sava Krsti´c2 Alain Mebsout1 , and Fatiha Za¨ıdi1 1

Source URL: cubicle.lri.fr

• Theoretical computer science
• Logic in computer science
• Temporal logic
• Constraint programming
• Electronic design automation
• Satisfiability modulo theories
• Alt-Ergo
• Computation tree logic
• Model theory

An Object-Oriented Framework for Explicit-State Model Checking Mark Kattenbelt1 and Theo C. Ruys2 and Arend Rensink2 Abstract. This paper presents a conceptual architecture for an object-oriented framework to support the

Source URL: qav.comlab.ox.ac.uk

• Theoretical computer science
• Formal methods
• Computing
• Mathematics
• Logic in computer science
• Graph rewriting
• Model checking
• Algorithm
• Formal verification
• Abstraction
• Generic programming
• Finite-state machine

JMIR MHEALTH AND UHEALTH Swendeman et al Original Paper

Source URL: destrin.smalldata.io

• Medicine
• Health
• Clinical medicine
• Journal of Medical Internet Research
• Cardiovascular disease
• MHealth
• Biomarker
• Recall
• Validity

Published as a conference paper at ICLRL EVERAGING G RAMMAR AND R EINFORCEMENT L EARNING FOR N EURAL P ROGRAM S YNTHESIS arXiv:1805.04276v1 [cs.LG] 11 May 2018

Source URL: rishabhmit.bitbucket.io

• Computational neuroscience
• Computing
• Artificial intelligence
• Machine learning
• Artificial neural networks
• Learning
• Convolutional neural network
• Long short-term memory
• Syntax
• Training
• test
• and validation sets
• Supervised learning
• Object Process Methodology

MiniMaxSat: a New Weighted Max-SAT Solver Federico Heras, Javier Larrosa, and Albert Oliveras Universitat Politecnica de Catalunya, Jordi Girona 1-3, 08034 Barcelona, Spain Abstract. In this paper we introduce M INI M A

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Logic in computer science
• Automated theorem proving
• Boolean algebra
• NP-complete problems
• Combinatorial optimization
• Maximum satisfiability problem
• Boolean satisfiability problem
• Resolution
• Unit propagation